全文获取类型
收费全文 | 258篇 |
免费 | 86篇 |
国内免费 | 11篇 |
出版年
2023年 | 2篇 |
2022年 | 2篇 |
2021年 | 7篇 |
2020年 | 9篇 |
2019年 | 8篇 |
2018年 | 3篇 |
2017年 | 15篇 |
2016年 | 20篇 |
2015年 | 24篇 |
2014年 | 15篇 |
2013年 | 12篇 |
2012年 | 20篇 |
2011年 | 33篇 |
2010年 | 17篇 |
2009年 | 20篇 |
2008年 | 16篇 |
2007年 | 21篇 |
2006年 | 21篇 |
2005年 | 18篇 |
2004年 | 10篇 |
2003年 | 8篇 |
2002年 | 11篇 |
2001年 | 15篇 |
2000年 | 5篇 |
1999年 | 5篇 |
1998年 | 5篇 |
1997年 | 2篇 |
1996年 | 3篇 |
1994年 | 1篇 |
1993年 | 3篇 |
1992年 | 1篇 |
1990年 | 2篇 |
1988年 | 1篇 |
排序方式: 共有355条查询结果,搜索用时 62 毫秒
61.
62.
We formulate and solve a discrete‐time path‐optimization problem where a single searcher, operating in a discretized three‐dimensional airspace, looks for a moving target in a finite set of cells. The searcher is constrained by maximum limits on the consumption of one or more resources such as time, fuel, and risk along any path. We develop a specialized branch‐and‐bound algorithm for this problem that uses several network reduction procedures as well as a new bounding technique based on Lagrangian relaxation and network expansion. The resulting algorithm outperforms a state‐of‐the‐art algorithm for solving time‐constrained problems and also is the first algorithm to solve multi‐constrained problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
63.
针对随机需求条件下的虚拟物流库存控制问题进行了深入研究,提出了一种新的联合库存控制策略——(T,S,s)策略,建立了相应的库存成本模型,并构造遗传算法对模型进行求解。结果分析表明,所提出的(T,S,S)联合库存控制策略是有效的。 相似文献
64.
Sanjay Mehrotra Hamed Rahimian Masoud Barah Fengqiao Luo Karolina Schantz 《海军后勤学研究》2020,67(5):303-320
We present a stochastic optimization model for allocating and sharing a critical resource in the case of a pandemic. The demand for different entities peaks at different times, and an initial inventory for a central agency are to be allocated. The entities (states) may share the critical resource with a different state under a risk-averse condition. The model is applied to study the allocation of ventilator inventory in the COVID-19 pandemic by FEMA to different U.S. states. Findings suggest that if less than 60% of the ventilator inventory is available for non-COVID-19 patients, FEMA's stockpile of 20 000 ventilators (as of March 23, 2020) would be nearly adequate to meet the projected needs in slightly above average demand scenarios. However, when more than 75% of the available ventilator inventory must be reserved for non-COVID-19 patients, various degrees of shortfall are expected. In a severe case, where the demand is concentrated in the top-most quartile of the forecast confidence interval and states are not willing to share their stockpile of ventilators, the total shortfall over the planning horizon (until May 31, 2020) is about 232 000 ventilator days, with a peak shortfall of 17 200 ventilators on April 19, 2020. Results are also reported for a worst-case where the demand is at the upper limit of the 95% confidence interval. An important finding of this study is that a central agency (FEMA) can act as a coordinator for sharing critical resources that are in short supply over time to add efficiency in the system. Moreover, through properly managing risk-aversion of different entities (states) additional efficiency can be gained. An additional implication is that ramping up production early in the planning cycle allows to reduce shortfall significantly. An optimal timing of this production ramp-up consideration can be based on a cost-benefit analysis. 相似文献
65.
Firing multiple artillery rounds from the same location has two main benefits: a high rate of fire at the enemy and improved accuracy as the shooter's aim adjusts to previous rounds. However, firing repeatedly from the same location carries significant risk that the enemy will detect the artillery's location. Therefore, the shooter may periodically move locations to avoid counter‐battery fire. This maneuver is known as the shoot‐and‐scoot tactic. This article analyzes the shoot‐and‐scoot tactic for a time‐critical mission using Markov models. We compute optimal move policies and develop heuristics for more complex and realistic settings. Spending a reasonable amount of time firing multiple shots from the same location is often preferable to moving immediately after firing an initial salvo. Moving frequently reduces risk to the artillery, but also limits the artillery's ability to inflict damage on the enemy. 相似文献
66.
67.
Michael C. Fu 《海军后勤学研究》2008,55(8):723-736
Derivatives (or gradients) are important for both sensitivity analysis and optimization, and in simulation models, these can often be estimated efficiently using various methods other than brute‐force finite differences. This article briefly summarizes the main approaches and discusses areas in which the approaches can most fruitfully be applied: queueing, inventory, and finance. In finance, the focus is on derivatives of another sort. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
68.
We examine several methods for evaluating resource acquisition decisions under uncertainty. Traditional methods may underestimate equipment benefit when part of this benefit comes from decision flexibility. We develop a new, practical method for resource planning under uncertainty, and show that this approach is more accurate than several commonly used methods. We successfully applied our approach to an investment problem faced by a major firm in the aviation information industry. Our recommendations were accepted and resulted in estimated annual savings in excess of $1 million (US). © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003 相似文献
69.
We present the green telecommunication network planning problem with switchable base stations, where the location and configuration of the base stations are optimized, while taking into account uncertainty and variability of demand. The problem is formulated as a two‐stage stochastic program under demand uncertainty with integers in both stages. Since solving the presented problem is computationally challenging, we develop the corresponding Dantzig‐Wolfe reformulation and propose a solution approach based on column generation. Comprehensive computational results are provided for instances of varying characteristics. The results show that the joint location and dynamic switching of base stations leads to significant savings in terms of energy cost. Up to 30% reduction in power consumption cost is achieved while still serving all users. In certain cases, allowing dynamic configurations leads to more installed base stations and higher user coverage, while having lower total energy consumption. The Dantzig‐Wolfe reformulation provides solutions with a tight LP‐gap eliminating the need for a full branch‐and‐price scheme. Furthermore, the proposed column generation solution approach is computationally efficient and outperforms CPLEX on the majority of the tested instances. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 351–366, 2016 相似文献
70.
The service‐provision problem described in this paper comes from an application of distributed processing in telecommunications networks. The objective is to maximize a service provider's profit from offering computational‐based services to customers. The service provider has limited capacity and must choose which of a set of software applications he would like to offer. This can be done dynamically, taking into consideration that demand for the different services is uncertain. The problem is examined in the framework of stochastic integer programming. Approximations and complexity are examined for the case when demand is described by a discrete probability distribution. For the deterministic counterpart, a fully polynomial approximation scheme is known 2 . We show that introduction of stochasticity makes the problem strongly NP‐hard, implying that the existence of such a scheme for the stochastic problem is highly unlikely. For the general case a heuristic with a worst‐case performance ratio that increases in the number of scenarios is presented. Restricting the class of problem instances in a way that many reasonable practical problem instances satisfy allows for the derivation of a heuristic with a constant worst‐case performance ratio. Worst‐case performance analysis of approximation algorithms is classical in the field of combinatorial optimization, but in stochastic programming the authors are not aware of any previous results in this direction. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003 相似文献